On numbers of pseudo-triangulations

نویسندگان

  • Moria Bergman
  • André Schulz
  • Adam Sheffer
چکیده

We study the maximum numbers of pseudo-triangulations and pointed pseudotriangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45 ) and Ω(2.41 ) for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of N points. For the number of all pseudo-triangulations contained in a triangulation we derive the bounds O∗(6.54N ) and Ω(3.30 ). We also prove that O∗(89.1N ) pointed pseudo-triangulations can be embedded over any specific set of N points in the plane, and at most 120 general pseudo-triangulations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting triangulations and pseudo-triangulations of wheels

Motivated by several open questions on triangulations and pseudotriangulations, we give closed form expressions for the number of triangulations and the number of minimum pseudo-triangulations of n points in wheel configurations, that is, with n − 1 in convex position. Although the numbers of triangulations and pseudotriangulations vary depending on the placement of the interior point, their di...

متن کامل

Counting and enumerating pseudo-triangulations with the greedy flip algorithm∗

This paper studies pseudo-triangulations for a given point set in the plane. Pseudo-triangulations have many properties of triangulations, and have more freedom since polygons with more than three vertices are allowed as long as they have exactly inner angles less than π. In particular, there is a natural flip operation on every internal edge. We establish fundamental properties of pseudo-trian...

متن کامل

Counting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm

This paper studies (pointed, or minimal) pseudotriangulations for a given point set in the plane. Pseudotriangulations have many properties of triangulations, and have more freedom since polygons with more than three vertices are allowed as long as exactly three have angles less than π. In particular, there is a natural flip operation on every internal edge. We establish fundamental properties ...

متن کامل

Expansive Motions and the Polytope of Pointed Pseudo-Triangulations

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its 1-skeleton is the graph whose vertices are the pointed pseudo-triangulations of the point set and whose edges are flips of interior pseudo-triangulation edges. For p...

متن کامل

Pseudo-tetrahedral complexes

A pseudo-triangulation is a cell complex in the plane whose cells are pseudo-triangles, i.e., simple polygons with exactly three convex vertices (so-called corners). Being an interesting and flexible generalization of triangulations, pseudo-triangulations have found their place in computational geometry; see e.g. [8, 11, 7, 1] and references therein. Unlike triangulations, pseudo-triangulations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Geom.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2013